Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
201	The Stanford GraphBase: A Platform for Combinatorial Algorithms A highly portable collection of programs and data will soon be available to researchers who study combinatorial algorithms and data structures. All ﬁles w Add to Reading List Source URL: shadow.ind.ntou.edu.tw Language: English - Date: 2007-12-06 06:56:00 Network theory Shortest path problem Planar graph Graph Morphisms Modular decomposition Graph isomorphism problem Graph theory Mathematics Theoretical computer science
202	The Stanford GraphBase: A Platform for Combinatorial Algorithms A highly portable collection of programs and data will soon be available to researchers who study combinatorial algorithms and data structures. All ﬁles w Add to Reading List Source URL: mirrors.fe.up.pt Language: English - Date: 2007-12-06 06:56:00 Network theory Shortest path problem Planar graph Graph Morphisms Modular decomposition Graph isomorphism problem Graph theory Mathematics Theoretical computer science
203	Microsoft Word - Proceedings P1.doc Add to Reading List Source URL: www.pacis-net.org Language: English - Date: 2014-05-20 03:49:38 Mathematics Directed acyclic graph Theoretical computer science Usability World Wide Web Degree Combinatorics Average path length Decomposition method Human–computer interaction Graph theory Network theory
204	Dual Decomposition for Parsing with Non-Projective Head Automata Terry Koo, Alexander M. Rush, Michael Collins, David Sontag, and Tommi Jaakkola The Cost of Model Complexity Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-10-11 21:31:57 Operations research Algorithm Mathematical logic Mathematical optimization Parsing Complexity Shortest path problem Mathematics Applied mathematics Theoretical computer science
205	On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing Alexander M. Rush, David Sontag, Michael Collins, and Tommi Jaakkola Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-10-10 11:23:50 Operations research CYK algorithm Linear programming Dynamic programming NP Shortest path problem Mathematical optimization Theoretical computer science Mathematics Applied mathematics
206	Scalable k-NN graph construction for visual descriptors∗ Jing Wang† Jingdong Wang‡ Gang Zeng† Zhuowen Tu‡ § Rui Gan† Shipeng Li‡ † Peking University ‡Microsoft Research Asia § Lab of Neuro Imaging and Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-03-30 05:59:42 Dimension reduction Nearest neighbor graph Nearest neighbor search Nonlinear dimensionality reduction K-nearest neighbor algorithm Relative neighborhood graph Graph Planar separator theorem Path decomposition Graph theory Mathematics Search algorithms
207	An Introduction To Ramsey Theory for Graphs Robert D. Borgersen [removed] Graduate Seminar: Ramsey Theory for Graphs – p. 1/1 Add to Reading List Source URL: home.cc.umanitoba.ca Language: English - Date: 2010-08-17 10:50:27 Ramsey theory Path decomposition Split graph Graph theory Mathematics Graph
208	Full Regularization Path for Sparse Principal Component Analysis Alexandre d’Aspremont ORFE, Princeton University, Princeton NJ 08544, USA. [removed] Add to Reading List Source URL: www.machinelearning.org Language: English - Date: 2008-12-01 11:24:18 Matrix theory Singular value decomposition Data analysis Operations research Principal component analysis Semidefinite programming Eigenvalues and eigenvectors Variance Linear programming Algebra Mathematics Linear algebra
209	NPS-MA[removed]NAVAL POSTGRADUATE SCHOOL Monterey, California A Partial Ordering of the Chordal Graphs Add to Reading List Source URL: edocs.nps.edu Language: English - Date: 2004-06-04 13:12:50 Split graph Interval graph Intersection graph Graph Clique Neighbourhood Path decomposition Lexicographic breadth-first search Graph theory Chordal graph Strongly chordal graph
210	Parameterized Quantum Query Complexity of Graph Collision ? Andris Ambainis, Kaspars Balodis, J¯anis Iraids, Raitis Ozols, and Juris Smotrovs arXiv:1305.1021v1 [quant-ph] 5 May 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-06 20:20:50 Tree Minor Graph Connectivity Path decomposition Dominating set Graph theory Tree decomposition NP-complete problems

UPDATE